منابع مشابه
Constructible Models of Orthomodular Quantum Logics
We continue in this article the abstract algebraic treatment of quantum sentential logics [39]. The Notions borrowed from the field of Model Theory and Abstract Algebraic Logic AAL (i.e., consequence relation, variety, logical matrix, deductive filter, reduced product, ultraproduct, ultrapower, Frege relation, Leibniz congruence, Suszko congruence, Leibniz operator) are applied to quantum logic...
متن کاملTransitive probabilistic CLIR models
Transitive translation could be a useful technique to enlarge the number of supported language pairs for a cross-language information retrieval (CLIR) system in a cost-effective manner. The paper describes several setups for transitive translation based on probabilistic translation models. The transitive CLIR models were evaluated on the CLEF test collection and yielded a retrieval effectivenes...
متن کاملConstructible Invariants
A local numerical invariant is a map ω which assigns to a local ring R a natural number ω(R). It induces on any scheme X a partition given by the sets consisting of all points x of X for which ω(OX,x) takes a fixed value. Criteria are given for this partition to be constructible, in case X is a scheme of finite type over a field. It follows that if the partition is constructible, then it is fin...
متن کاملLecture 16: Constructible Reals
Definition 16.1 (Kleene): A set A ⊆ �� is Σn if there exists an arithmetical formula φ(α,β1, . . . ,βn) such that α ∈ A ⇔ ∃β1∀β2 . . .Qβn φ(α,β1, . . . ,βn) where Q is ∃ if n is odd and Q is ∀ if n is even. Similarly, A⊆ �� is Πn if there exists an arithmetical formula φ(α,β1, . . . ,βn) such that α ∈ A ⇔ ∀β1∃β2 . . .Qβn φ(α,β1, . . . ,βn) where Q is ∀ if n is odd and Q is ∃ if n is even. A set...
متن کاملClassification of Constructible Cosheaves
Informally speaking, a map is stratified if it is proper and there is a partition S of X into manifolds so that over each manifold S ∈ S the map f(S)→ S is a fiber bundle. One perspective on this question uses the open sets of X to define a functor F̂ : Open(X)→ Set that assigns to each open U the set π0(f (U)) of path components. This functor satisfies a gluing axiom reminiscent of the usual va...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fundamenta Mathematicae
سال: 1977
ISSN: 0016-2736,1730-6329
DOI: 10.4064/fm-96-3-161-172